Leftover hash lemma

Results: 30



#Item
11Entropy / SHA-2 / Preimage attack / SHA-1 / Hash function / HMAC / Padding / NIST hash function competition / Leftover hash lemma / Cryptographic hash functions / Error detection and correction / Cryptography

Paragraph[removed]of the Code of Ethics Estate agents and salespersons should be fully conversant with the EAO, its subsidiary legislation, this Code of Ethics, and other guidelines issued by the EAA from time to time and

Add to Reading List

Source URL: text.eaa.org.hk

Language: English - Date: 2013-07-22 00:20:20
12Entropy / SHA-2 / Preimage attack / SHA-1 / Hash function / HMAC / Padding / NIST hash function competition / Leftover hash lemma / Cryptographic hash functions / Error detection and correction / Cryptography

Why narrow-pipe cryptographic hash functions are not a match to wide-pipe cryptographic hash functions? Danilo Gligoroski [removed] Faculty of Information Technology, Mathematics and Electrical Engin

Add to Reading List

Source URL: cryptography.hyperlink.cz

Language: English - Date: 2010-12-04 13:55:47
13Pseudorandomness / Computational complexity theory / Randomness / Randomness extractor / Pseudorandom generator / Extractor / Leftover hash lemma / Information theory / Entropy / Theoretical computer science / Applied mathematics / Mathematics

Randomness in Cryptography April 6, 2013 Lecture 12: Computational Key Derivation Lecturer: Yevgeniy Dodis

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:30
14Computational complexity theory / Randomness extractor / Information theory / Finite fields / Leftover hash lemma / Entropy / XTR / Pseudorandom generator / Cryptographic hash function / Cryptography / Applied mathematics / Randomness

Overcoming Weak Expectations Yevgeniy Dodis∗ Yu Yu† December 22, 2012

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2012-12-22 10:21:59
15Mathematics / Computational complexity theory / Randomness extractor / Pseudorandomness / Information theory / Entropy / Extractor / Leftover hash lemma / Theoretical computer science / Applied mathematics / Randomness

Microsoft PowerPoint - no-waste

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:32
16Cryptography / Randomness / Extractor / Pseudorandomness / Min-entropy / Leftover hash lemma / Entropy / Randomness extractor / Information theory / Applied mathematics / Theoretical computer science

April 25, 2013 Randomness in Cryptography Lecture 15: Privacy Amplification against Active Attackers Lecturer: Yevgeniy Dodis

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:31
17Randomness / Computational complexity theory / Information theory / Pseudorandomness / Randomness extractor / Extractor / Leftover hash lemma / Random number generation / Entropy / Applied mathematics / Theoretical computer science / Cryptography

Microsoft PowerPoint - extractor-survey-teaching [Compatibility Mode]

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:27
18Theoretical computer science / Information theory / Pseudorandom number generators / Extractor / Pseudorandomness / Entropy / Leftover hash lemma / Random number generation / Salil Vadhan / Randomness / Cryptography / Applied mathematics

Microsoft PowerPoint - condenser

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:27
19Randomness / Computational complexity theory / Information theory / Randomness extractor / Pseudorandomness / Extractor / Min-entropy / Leftover hash lemma / Entropy / Theoretical computer science / Applied mathematics / Cryptography

Randomness in Cryptography May 2, 2013 Lecture 16: Special Purpose Extractors Lecturer: Yevgeniy Dodis

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:31
20Cryptography / Entropy / Min-entropy / Leftover hash lemma / Communication complexity / Extractor / Commitment scheme / Randomness extractor / Theoretical computer science / Information theory / Applied mathematics

Non-Malleable Condensers for Arbitrary Min-Entropy, and Almost Optimal Protocols for Privacy Amplification Xin Li∗ Department of Computer Science Johns Hopkins University Baltimore, MD 21218, U.S.A.

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-11 17:35:40
UPDATE